Connectivity and separating sets of cages

نویسندگان

  • Tao Jiang
  • Dhruv Mubayi
چکیده

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraphG[S] has diameter at least bg/2c, with equality only when distance bg/2c occurs for at least two pairs of vertices in G[S]. This structural property is used to prove that every (k; g)-cage with k ≥ 3 is 3-connected. This result supports the conjecture of Fu, Huang, and Rodger that every (k; g)-cage is k-connected. A nonseparating g-cycle C in a graph G is a cycle of length g such that G − V (C) is connected. We prove that every (k; g)-cage contains a nonseparating g-cycle. For even g, we prove that every g-cycle in a (k; g)-cage is nonseparating. c © 1998 John Wiley & Sons, Inc. J Graph Theory 29: 35–44, 1998

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectivity of Strong Products of Graphs

Definition(s): Let G = (V,E) be a graph. A set S ⊆ V is called separating in G if G− S is not connected. The connectivity of G, written κ(G), is the minimum size of a set S, such that G−S is not connected or has only one vertex. A separating set in G with cardinality κ(G) is called a κ-set in G. Let G1 = (V1, E1) and G2 = (V2, E2) be a graphs. Strong product G1 G2 of graphs G1 and G2 is the gra...

متن کامل

On superconnectivity of (4, g)-cages with even girth

A (k, g)-cage is a k-regular graph with girth g that has the fewest number of vertices. It has been conjectured [Fu, Huang, and Rodger, Connectivity of cages, J. Graph Theory 24 (1997), 187-191] that all (k, g)-cages are k-connected for k ≥ 3. A connected graph G is said to be superconnected if every minimum cut-set S is the neighborhood of a vertex of minimum degree. Moreover, if G − S has pre...

متن کامل

On Some Properties of Cages

A (k; g)-cage is a graph with the minimum order among all k-regular graphs with girth g. As a special family of graphs, (k; g)-cages have a number of interesting properties. In this paper, we investigate various properties of cages, e.g., connectivity, the density of shortest cycles, bricks and braces.

متن کامل

Finding all minimum-size separating vertex sets in a graph

We present a new algorithm based upon network flows for finding all minimum size separating vertex sets in an undirected graph. The sequential implementation of our algorithm runs in ®(mm(max(Mnk,knmmin(k,'In)),mQx(Mn,k2n3))) = 0 (2 kn3) time, where M is the number of minimum size separating vertex sets The parallel implementai 6 tion runs either in 0 (&logn) deterministic time using ©(M2n2 + k...

متن کامل

Connectivity of cages

A (k; g)-graph is a k-regular graph with girth g. Let f(k; g) be the smallest integer ν such there exists a (k; g)-graph with ν vertices. A (k; g)-cage is a (k; g)-graph with f(k; g) vertices. In this paper we prove that the cages are monotonic in that f(k; g1) < f(k; g2) for all k ≥ 3 and 3 ≤ g1 < g2. We use this to prove that (k; g)-cages are 2-connected, and if k = 3 then their connectivity ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 29  شماره 

صفحات  -

تاریخ انتشار 1998